鄂坪水电站长期优化调度研究

针对鄂坪水电站的长期优化调度问题,建立了考虑保证出力发电量最大和不考虑保证出力发电量最大两种求解模型,用动态规划法进行了计算,并对两种模型下的发电量、水位过程和出力过程进行了比较分析。     

基于动态规划法求解动态o-1背包问题

随机时变背包问题(RTVKP)是一种动态组合优化问题,也是一种典型的NP-hard问题。由于RTVKP问题中物品的价值、重量和背包载重均是动态变化的,导致问题的求解非常困难。在动态规划法基础上,提出了一种求解背包载重随机变化的RTVKP问题的确定性算法,分析了其复杂度和成功求解需要满足的条件。对两个大规模实例的计算表明,该算法是求解RTVKP问题的一种高效算法。     

关于并行语言Gamma的结构化扩充

Gamma(general abstract model for multiset manipulation)语言是一个可以避免人为序化的高层次并行程序设计工具.P.Frade t等人提出结构化Gamma以利于结构化应用数据以及表达特殊的控制约束和程序的自动分析. 在摒弃了基于“地址”的定义方式的基础上,给出结构化Gamma的更一般形式的语法、语义描 述,在两个层次上讨论结构重集(structured multiset)的类型,并指出,这种新模型保持了有 关程序的静态类型检测等理论成果.     

FlexPDA: A Flexible Programming Framework for Deep Learning Accelerators

There are a wide variety of intelligence accelerators with promising performance and energy efficiency, deployed in a broad range of applications such as computer vision and speech recognition. However, programming productivity hinders the deployment of deep learning accelerators. The low-level library invoked in the high-level deep learning framework which supports the end-to-end execution with a given model, is designed to reduce the programming burden on the intelligence accelerators. Unfortunately, it is inflexible for developers to build a network model for every deep learning application, which probably brings unnecessary repetitive implementation. In this paper, a flexible and efficient programming framework for deep learning accelerators, FlexPDA, is proposed, which provides more optimization opportunities than the low-level library and realizes quick transplantation of applications to intelligence accelerators for fast upgrades. We evaluate FlexPDA by using 10 representative operators selected from deep learning algorithms and an end-to-end network. The experimental results validate the effectiveness of FlexPDA, which achieves an end-to-end performance improvement of 1.620x over the low-level library.     

电压闪变分析软件设计与实现

电压波动和闪变是衡量电能质量优劣的重要指标,电压闪变信号的检测现已成为国内外研究的热点.为了更方便、准确地测量电压闪变信号,在LabWindows/CVI环境下设计并实现了一种电压闪变小波分析软件.该设计通过调用动态链接库的方法,实现了LabWindows/CVI与Matlab的混合编程,既提升了虚拟仪器软件的开发效率,又提高了可扩展性;采用开源数据库SQLite3存储数据,进一步降低了系统的内存开销与经济开支.试验结果表明,闪变测量模块的测量精度满足IEC的精度要求.     

基于COM技术的雷达数据处理软件系统设计

雷达数据处理软件系统是一个复杂的软件系统,应用软件工程方法,采用.NET和VC 6混合编程实现。提出模块化的软件系统设计框架,并应用COM技术无缝集成不同编程语言开发的模块。简要介绍COM原理,给出雷达数据处理软件系统的设计框架,讨论了.NET开放COM接口和VC 6中对COM接口调用的方法,给出了COM技术在软件编码中的应用实例。结果表明,采用基于COM技术的模块化混合编程,是实现雷达数据处理软件系统的一种有效方法。     

Formulations for an inventory routing problem

In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benchmark instances. One of the most significant conclusions is that the formulations that use vehicle‐indexed variables are superior to the more compact, aggregate formulations.     

Scaling of program functionality

The distribution of fitness values (landscapes) of programs tends to a limit as the programs get bigger. We use Markov chain convergence theorems to give general upper bounds on the length of programs needed for convergence. How big programs need to be to approach the limit depends on the type of the computer they run on. We give bounds (exponential in N, N log N and smaller) for five computer models: any, average or amorphous or random, cyclic, bit flip and four functions (AND, NAND, OR and NOR). Programs can be treated as lookup tables which map between their inputs and their outputs. Using this we prove similar convergence results for the distribution of functions implemented by linear computer programs. We show most functions are constants and the remainder are mostly parsimonious. The effect of ad-hoc rules on genetic programming (GP) are described and new heuristics are proposed. We give bounds on how long programs need to be before the distribution of their functionality is close to its limiting distribution, both in general and for average computers. The computational importance of destroying information is discussed with respect to reversible and quantum computers. Mutation randomizes a genetic algorithm population in generations. Results for average computers and a model like genetic programming are confirmed experimentally.     

三峡工程两坝联合通航调度的混合模拟退火算法

对三峡大坝和葛洲坝的一共5座船闸进行统一的船舶通航调度管理,是提高长江三峡水域航运能力的关键,然而其优化调度算法还缺乏必要的研究.本文首先提出了该问题的混合整数非线性规划模型,在实际通航调度环境中,该模型属于强NP-hard复杂度的大规模组合优化问题,因此设计了一种混合模拟退火算法来搜索次优化调度方案,该算法将解分解为闸次时间表和船舶调度计划两部分,在搜索过程中用启发式规则对闸次时日表进行调整,然后用深度优先搜索(DFS)算法根据闸次时间表求解船舶调度计划,最后根据Metropolis规则对当前解进行更新.针对实际通航数据的测试结果表明其优化效果明显优于原有的启发式算法.目前该算法已经成功地应用于实际的两坝联合通航调度系统中.     

浅析如何提高C语言程序设计课的教学效果

C语言是一门应用广泛的结构化程序设计语言,掌握好C语言,不但能提高程序设计的能力,也能为多门后续课程打下坚实的基础。本人在长期从事C语言程序设计课的教学过程中,通过不断总结,不断积累,得出了一种行之有效的教学方法,该方法根据不同的教学对象,将不同的已有教学方法灵活地结合在一起,通过教学实践,取得了很好的教学效果。